In order to further improve the security and efficiency of Number Theory Research Unit (NTRU)-type Multi-Key Fully Homomorphic Encryption (MKFHE) schemes, based on the prime power cyclotomic rings, the properties of the original decryption structure of NTRU-type multi-key fully homomorphic encryption were studied, and two optimization methods of multi-key homomorphic decryption structures were proposed. Firstly, by reducing the polynomial's coefficients, the "Regev-Style" multi-key decryption structure was designed. Secondly, the "Ciphertext-Expansion" multi-key decryption structure was designed by expanding the dimension of ciphertexts. Compared with the original decryption structure of NTRU-type multi-key homomorphic encryption scheme, the "Regev-Style" multi-key decryption structure reduced the magnitude of error, which was able to reduce the number of key-switching and modulo-switching when it was used in the design of NTRU-type multi-key homomorphic encryption scheme; the "Ciphertext-Expansion" multi-key decryption structure eliminated the key-switching operation, reduced the magnitude of error, and was able to process the ciphertext product of repeated users more effectively. The security of the optimized multi-key decryption structures was based on the Learning With Errors (LWE) problem and Decisional Small Polynomial Ratio (DSPR) assumption on the prime power cyclotomic rings, so these structures were able to resist subfield attacks well. Therefore, they can be used to design a more secure and efficient NTRU-type multi-key fully homomorphic encryption scheme by selecting appropriate parameters.

Focused on the issue that the sorting operation mechanical arm which used Case-Based Reasoning (CBR) mechanism could not be used for the complex scenario with a lot of object information, an improved Case-Based Reasoning-Belief, Desire, Intention (CBR-BDI) reasoning mechanism was proposed. Firstly, the input information was regarded as belief, and the case properties obtained through sentence segmentation and retrieval was regarded as desire. Secondly, map matching, desire analysis and guidance were added to perfect desire. Finally, complete desire generated solution which was regarded as intention. In the scenario of multiple object and information, users could command system for sorting operation through dialogue. The experimental results show that compared with the traditional CBR mechanism, the improved CBR-BDI reasoning mechanism possess the ability of analysis and guide, and can be used for the scenario of multiple object and information.

Focusing on the issue that the tracking algorithm based on template matching has poor performance in running speed and success rate, a template matching tracking algorithm based on Particle Swarm Optimization (PSO) was proposed. The algorithm took the PSO algorithm as the search strategy of the candidate templates in template matching algorithm, and the target template was updated self-adaptively. Firstly, 30 candidate templates were selected in a search scope and then the individual and global optimal candidate template were selected; secondly, the best candidate template was worked out through the particle swarm optimization and the target is the best one; finally, the target template was updated self-adaptively based on the matching rate of the best candidate template. The theoretical analysis and simulation experiments show that, compared with the tracking algorithm based on template matching and the template matching tracking algorithm based on the rough search and refined by search, the computation of the template matching tracking algorithm based on particle swarm optimization is greatly reduced about 91.1% and 69.8%, and the success rate is 2.02 times and 1.94 times of the primary algorithm. The experiment show that the new algorithm can achieve well real-time tracking and the robustness and accuracy of tracking is greatly improved.

Concerning the problem that the current network security situation assessment has characteristics of limited scope, single information source, high time and space complexity and big deviation in accuracy, a new network security situation assessment method based on Naive Bayes classifier was proposed. It fully considered multi-information sources and fusion of multi-level heterogeneous information, and had the features of rapidity and high efficiency. It dynamically demonstrated the whole security state of the network, which could precisely reflect the network security situation. Finally, the proposed method was verified using the reality data from network and its validity was proved.

To solve the problems of complex planning method, too many man-made specified parameters and huge computation in the existing gait dynamic model, the gait generation approach of humanoid robot based on the data collected by Kinect to learn human gait was proposed. Firstly, the skeleton information was collected by Kinect device, human joint local coordinate system was built by the least square fitting method. Next, the dynamic model of human body mapping robot was built, and robot joint angle trajectory was generated according to mapping relation between main joints, the studies of walking posture from human was realized. Then, Robot's ankle joint was optimized and controlled by gradient descent on the basis of Zero-Moment Point (ZMP) stability principle. Finally, on the gait stability analysis, safety factor was proposed to evaluate the stability of robot walk. The experimental results show that the safety factor of walking keeps in 0 to 0.85, experctation is 0.4825 and ZMP closes to stable regional centres, the robot realizes walking imitating human posture and gait stability, which proves the validity of the method.

The access control policy of information grid was proposed, so was the definition of permit and role. How to use one-dimensional string to represent permit and role, the containing relationship of operation, and the inheriting relationship of role were analysed. The method to deal with the contradiction and redundancy of role assignment by containing relationship of operation and inheriting relationship of role was described. The performance of permit assignment by the system automatically was evaluated.

An EVP space model of information grid subject was proposed in this paper according to the research on object space model. Using the theory of user’s full life cycle (includes register, log on, use, maintenance, hang up, reconnect, exit, and log out), the processes of the grid users were studied; the change of this model during the different processes of the user’s full life cycle was analyed; the applications of this model in the project of VEGA-IG were introduced, to solve the problems of information grid users, such as distributing, heterogeneous and uniform identification were tried.

According to the traits and requirements of protocol conformance testing, especially the characteristic of OSPF protocol, the design of a conformance testing system for OSPFv3 protocol was introduced. In our design, the environment of multiple virtual testers with controlling channel was used and Tcl language was choosed as test case describing language. This conformance testing system gets both good testing ability and flexibility. Testing of several different implementations of OSPFv3 protocol was accomplished. An example was shown, and the future work was also discussed.